Update crates/bevy_ecs/src/query/access.rs docs

Co-authored-by: Alice Cecile <[email protected]>

crates/bevy_ecs/src/query/access.rs

@@ -272,8 +272,8 @@ impl<T: SparseSetIndex> FilteredAccess<T> {
 
     /// Adds a `With` filter: corresponds to a conjunction (AND) operation.
     ///
-    /// For example, in case we have `Or<(With<A>, With<B>)>`, which is represented by an array of two `AccessFilter` instances,
-    /// adding `AND With<C>` gets expanded into `Or<((With<A>, With<C>), (With<B>, With<C>))>`.
+    /// Suppose we begin with `Or<(With<A>, With<B>)>`, which is represented by an array of two `AccessFilter` instances.
+    /// Adding `AND With<C>` via this method transforms it into the equivalent of  `Or<((With<A>, With<C>), (With<B>, With<C>))>`.
     pub fn and_with(&mut self, index: T) {
         let index = index.sparse_set_index();
         for filter in &mut self.filter_sets {